Adaptive Codes: A New Class of Non-standard Variable-length Codes

نویسنده

  • Dragos Trinca
چکیده

We introduce a new class of non-standard variable-length codes, called adaptive codes. This class of codes associates a variable-length codeword to the symbol being encoded depending on the previous symbols in the input data string. An efficient algorithm for constructing adaptive codes of order one is presented. Then, we introduce a natural generalization of adaptive codes, called GA codes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Special Cases of Encodings by Generalized Adaptive Codes

Adaptive (variable-length) codes associate variable-length codewords to symbols being encoded depending on the previous symbols in the input data string. This class of codes has been presented in [10, 11] as a new class of non-standard variable-length codes. Generalized adaptive codes (GA codes, for short) have been also presented in [10, 11] not only as a new class of nonstandard variable-leng...

متن کامل

Modelling the EAH Data Compression Algorithm using Graph Theory

Adaptive codes associate variable-length codewords to symbols being encoded depending on the previous symbols in the input data string. This class of codes has been introduced in [9] as a new class of non-standard variable-length codes. New algorithms for data compression, based on adaptive codes of order one, have been presented in [10], where we have behaviorally shown that for a large class ...

متن کامل

EAH: A New Encoder based on Adaptive Variable-length Codes

Adaptive variable-length codes associate a variable-length codeword to the symbol being encoded depending on the previous symbols in the input string. This class of codes has been recently presented in [Dragoş Trincă, arXiv:cs.DS/0505007] as a new class of non-standard variable-length codes. New algorithms for data compression, based on adaptive variable-length codes of order one and Huffman’s ...

متن کامل

ar X iv : c s . D S / 05 08 08 9 v 1 21 A ug 2 00 5 Modelling the EAH Data Compression Algorithm using Graph Theory ∗

Adaptive codes associate variable-length codewords to symbols being encoded depending on the previous symbols in the input data string. This class of codes has been introduced in [9] as a new class of non-standard variable-length codes. New algorithms for data compression, based on adaptive codes of order one, have been presented in [10], where we have behaviorally shown that for a large class ...

متن کامل

Translating the EAH Data Compression Algorithm into Automata Theory

Adaptive codes have been introduced in [5] as a new class of non-standard variablelength codes. These codes associate variable-length codewords to symbols being encoded depending on the previous symbols in the input data string. A new data compression algorithm, called EAH, has been introduced in [7], where we have behaviorally shown that for a large class of input data strings, this algorithm ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/cs/0505007  شماره 

صفحات  -

تاریخ انتشار 2005